Solving reward-collecting problems with UAVs: a comparison of online optimization and Q-learning

Uncrewed autonomous vehicles (UAVs) have made significant contributions to reconnaissance and surveillance missions in past US military campaigns. As the prevalence of UAVs increases, there has also been improvements in counter-UAV technology that makes it difficult for them to successfully obtain valuable intelligence within an area of interest. Hence, it has become important that modern UAVs can accomplish their missions while maximizing their chances of survival. In this work, we specifically study the problem of identifying a short path from a designated start to a goal, while collecting all rewards and avoiding adversaries that move randomly on the grid. We also provide a possible application of the framework in a military setting, that of autonomous casualty evacuation. We present a comparison of three methods to solve this problem: namely we implement a Deep Q-Learning model, an ε-greedy tabular Q-Learning model, and an online optimization framework. Our computational experiments, designed using simple grid-world environments with random adversaries showcase how these approaches work and compare them in terms of performance, accuracy, and computational time.R.Y. is partially supported by NSF DMS 1916037 and Consortium for Robotics and Unmanned Systems Education and Research (CRUSER).NSF DMS 1916037Consortium for Robotics and Unmanned Systems Education and Research (CRUSER

SARS-CoV-2 Dissemination using a Network of the United States Counties

During 2020 and 2021, severe acute respiratory syndrome coron- avirus 2 (SARS-CoV-2) transmission has been increasing amongst the world’s population at an alarming rate. Reducing the spread of SARS-CoV-2 and other diseases that are spread in similar manners is paramount for public health of- ficials as they seek to effectively manage resources and potential population control measures such as social distancing and quarantines. By analyzing the United States’ county network structure, one can model and interdict poten- tial higher infection areas. County officials can provide targeted information, preparedness training, as well as increase testing in these areas. While these approaches may provide adequate countermeasures for localized areas, they are inadequate for the holistic United States. We solve this problem by col- lecting coronavirus disease 2019 (COVID-19) infections and deaths from the Center for Disease Control and Prevention and a network adjacency structure from the United States Census Bureau. Generalized network autoregressive (GNAR) time series models have been proposed as an efficient learning algorithm for networked datasets. This work fuses network science and operations research techniques to univariately model COVID-19 cases, deaths, and cur- rent survivors across the United States’ county network structure

Two-Echelon Vehicle and UAV Routing for Post-Disaster Humanitarian Operations with Uncertain Demand

Humanitarian logistics service providers have two major responsibilities immediately after a disaster: locating trapped people and routing aid to them. These difficult operations are further hindered by failures in the transportation and telecommunications networks, which are often rendered unusable by the disaster at hand. In this work, we propose two-echelon vehicle routing frameworks for performing these operations using aerial uncrewed autonomous vehicles (UAVs or drones) to address the issues associated with these failures. In our proposed frameworks, we assume that ground vehicles cannot reach the trapped population directly, but they can only transport drones from a depot to some intermediate locations. The drones launched from these locations serve to both identify demands for medical and other aids (e.g., epi-pens, medical supplies, dry food, water) and make deliveries to satisfy them. Specifically, we present two decision frameworks, in which the resulting optimization problem is formulated as a two-echelon vehicle routing problem. The first framework addresses the problem in two stages: providing telecommunications capabilities in the first stage and satisfying the resulting demands in the second. To that end, two types of drones are considered. Hotspot drones have the capability of providing cell phone and internet reception, and hence are used to capture demands. Delivery drones are subsequently employed to satisfy the observed demand. The second framework, on the other hand, addresses the problem as a stochastic emergency aid delivery problem, which uses a two-stage robust optimization model to handle demand uncertainty. To solve the resulting models, we propose efficient and novel solution approaches

Multi loci phylogenetic analysis with gene tree clustering

In order to conduct a statistical analysis on a given set of phylogenetic gene trees, we often use a distance measure between two trees. In a statistical distance-based method to analyze discordance between gene trees, it is a key to decide “biologically meaningful” and “statistically well-distributed” distance between trees. Thus, in this paper, we study the distributions of the three tree distance metrics: the edge difference, the path difference, and the precise K interval cospeciation distance, between two trees: First, we focus on distributions of the three tree distances between two random unrooted trees with n leaves (n ≥ 4); and then we focus on the distributions the three tree distances between a fixed rooted species tree with n leaves and a random gene tree with n leaves generated under the coalescent process with the given species tree. We show some theoretical results as well as simulation study on these distributions. Key Words: Coalescent, Phylogenetics, Tree metrics, Tree topologies

Fifth International Conference on the Dynamics of Information Systems

The contributions of this volume stem from the “Fifth International Conference on the Dynamics of Information Systems” held in Gainesville, FL in February 2013, and discuss state-of the-art  techniques in handling problems and solutions in the broad field of information systems. Dynamics of Information Systems: Computational and Mathematical Challenges presents diverse aspects of modern information systems with an emphasis on interconnected network systems and related topics, such as signal and message reconstruction, network connectivity, stochastic network analysis, cyber and computer security, community and cohesive structures in complex networks. Information systems are a vital part of modern societies. They are essential to our daily actions, including social networking, business and bank transactions, as well as sensor communications. The rapid increase in these capabilities has enabled us with more powerful systems, readily available to sense, control, disperse, and analyze information